For further study , many variations have been introduced , which are known as higher order connectedness , such as super - connectedness , hyper - connectedness , super - a , r - restricted edge connectivity , etc . this dissertation studies graphs , especially symmetric graphs , with higher order connectedness 為了進(jìn)一步的研究,人們提出了各種各樣的高階連通性概念,如super -性, hyper -性,超邊連通性, r -限制性邊連通度等。本論文主要利用圖的高階連通性研究網(wǎng)絡(luò)(特別是對(duì)稱網(wǎng)絡(luò))的可靠性。
In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1?v1 and u2?v2 of G, there is an automorphism